Towards an energy complexity of computation
نویسنده
چکیده
Energy consumption is becoming a critical complexity parameter along with time (delay) in the design and optimization of algorithms at both the hardware and software levels. This paper proposes that a new complexity measure including energy E and time t in the form of the expression E × t2 be used as the measure of the efficiency of a computation. We prove that the metric is optimal. As an example, a new result concerning the optimal length of a pipeline is derived. 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
A Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملDesign and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملDesign and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملANFIS modeling and validation of a variable speed wind turbine based on actual data
In this research paper, ANFIS modeling and validation of Vestas 660 kW wind turbine based on actual data obtained from Eoun-Ebn-Ali wind farm in Tabriz, Iran, and FAST is performed. The turbine modeling is performed by deriving the non-linear dynamic equations of different subsystems. Then, the model parameters are identified to match the actual response. ANFIS is an artificial intelligent tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 77 شماره
صفحات -
تاریخ انتشار 2001